type github.com/andybalholm/brotli.hashForgetfulChain

14 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L267: 		return &hashForgetfulChain{
		hash.go#L274: 		return &hashForgetfulChain{
		hash.go#L281: 		return &hashForgetfulChain{
		hash_forgetful_chain.go#L11: func (*hashForgetfulChain) HashTypeLength() uint {
		hash_forgetful_chain.go#L15: func (*hashForgetfulChain) StoreLookahead() uint {
		hash_forgetful_chain.go#L20: func (h *hashForgetfulChain) HashBytes(data []byte) uint {
		hash_forgetful_chain.go#L39: type hashForgetfulChain struct {
		hash_forgetful_chain.go#L55: func (h *hashForgetfulChain) Initialize(params *encoderParams) {
		hash_forgetful_chain.go#L76: func (h *hashForgetfulChain) Prepare(one_shot bool, input_size uint, data []byte) {
		hash_forgetful_chain.go#L110: func (h *hashForgetfulChain) Store(data []byte, mask uint, ix uint) {
		hash_forgetful_chain.go#L126: func (h *hashForgetfulChain) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) {
		hash_forgetful_chain.go#L133: func (h *hashForgetfulChain) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ring_buffer_mask uint) {
		hash_forgetful_chain.go#L144: func (h *hashForgetfulChain) PrepareDistanceCache(distance_cache []int) {
		hash_forgetful_chain.go#L159: func (h *hashForgetfulChain) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) {